Maintaining a Partition

نویسنده

  • Jonathan Turner
چکیده

A partition of a set is a collection of subsets that are pair-wise mutually exclusive and whose union includes every member of the set. In many graph algorithms it’s useful to have a data structure for maintaining a partition on the vertices of the graph that allows us to quickly determine if two vertices are in the same subset, and to quickly combine two subsets. More precisely, the partition data structure maintains a partition on an underlying set S and supports the following operations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A partition-based algorithm for clustering large-scale software systems

Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...

متن کامل

EXPERIMENTALl ANALYSIS OF PARTITION COEFFICIENT IN Al-Mg ALLOYS

Because the partition coefficient is one of the most important parameters affecting microsegregation, the aim of this research is to experimentally analyse the partition coefficient in Al-Mg alloys. In order to experimentally measure the partition coefficient, a series of quenching experiments during solidification were carried out. For this purpose binary Al-Mg alloys containing 6.7 and 10.2 w...

متن کامل

A Multidimensional Data Structure for Maintaining XML Data Partitions

To achieve good performance of processing queries on huge XML data in cluster machines, data partitioning and placement strategy is one of the key factors. In this paper we propose a multidimensional data structure for maintaining XML data partitions, specifically for holistic twig join processing. Initially, we construct the multidimensional data structure from statistical information on vario...

متن کامل

Prediction of effect of fine particle removal on efficiency of a spiral circuit by size-by-size partition curves

Partition curves are widely used to determine the spiral separator efficiency. In this work, the partition curves were used in order to investigate the particle transportation to concentrate and tailing streams. Simulation of fine particle removal using the size-by-size partition curves showed that the recovery of gangue particles to concentrate can decrease 8.7%. It also showed that the recove...

متن کامل

Data Structures for Maintaining Set Partitions

Each test or feature in a classification system defines a set partition on a class of objects. Adding new features refines the classification, whereas deleting features may result in merging previously distinguished classes. As an illustration, consider the set of automobile types { VW Beetle, Toyota, Lexus, Cadillac }. The feature size partitions the cars into sets of small and large cars, {{ ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010